<<<<<<< HEAD
/*
  SortTable
  version 2
  7th April 2007
  Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/
  
  Instructions:
  Download this file
  Add <script src="sorttable.js"></script> to your HTML
  Add class="sortable" to any table you'd like to make sortable
  Click on the headers to sort
  
  Thanks to many, many people for contributions and suggestions.
  Licenced as X11: http://www.kryogenix.org/code/browser/licence.html
  This basically means: do what you want with it.

  -- pfSense modifications --
  Allow for sorting of IP adresses
  2012-09-15 Allow for multiple header rows, using "sortableHeaderRowIdentifier" class for the TR that has the column headers. (used in firewall-log)
  2012-09-15 Allow sorting multiple dual/mutlti rows together, using sortablemultirow="2" attribute for the table
  2012-09-15 Allow sorting of IP:Port texts, changed sort compare function
  2012-11-05 Allow sorting of IP:Port and *:port texts toghether also AAA_23 AAA_123 in 'numeric order' (used in Diagnostics\Sockets column LOCAL)
*/

 
var stIsIE = /*@cc_on!@*/false;

sorttable = {
	init: function() {
		// quit if this function has already been called
		if (arguments.callee.done) return;
		// flag this function so we don't do the same thing twice
		arguments.callee.done = true;
		// kill the timer
		if (_timer) clearInterval(_timer);
		
		if (!document.createElement || !document.getElementsByTagName) return;
		
		sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;
		
		forEach(document.getElementsByTagName('table'), function(table) {
			if (table.className.search(/\bsortable\b/) != -1) {
				sorttable.makeSortable(table);
			}
		});
		
	},
	
	makeSortable: function(table) {
		if (table.getElementsByTagName('thead').length == 0) {
			// table doesn't have a tHead. Since it should have, create one and
			// put the first table row in it.
			the = document.createElement('thead');
			the.appendChild(table.rows[0]);
			table.insertBefore(the,table.firstChild);
		}
		// Safari doesn't support table.tHead, sigh
		if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0];
		
		headrow = undefined;
		if (table.tHead.rows.length == 1)
			headrow = table.tHead.rows[0].cells;
		else
		{			
			//if multiple rows are found one must be marked with class <tr class="sortableHeaderRowIdentifier">
			for (var i=0; i<table.tHead.rows.length; i++) {
				if (table.tHead.rows[i].className.search(/\bsortableHeaderRowIdentifier\b/)  != -1)
				{
					headrow = table.tHead.rows[i].cells;
					break;
				}
			}
		}
		if (headrow == undefined)
			return;
		
		if (table.getAttribute("sortableMultirow") != undefined)
			sortableMultirow = parseInt(table.getAttribute("sortableMultirow"));
		else
			sortableMultirow = 1;
		
		// Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
		// "total" rows, for example). This is B&R, since what you're supposed
		// to do is put them in a tfoot. So, if there are sortbottom rows,
		// for backwards compatibility, move them to tfoot (creating it if needed).
		sortbottomrows = [];
		for (var i=0; i<table.rows.length; i++) {
			if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
				sortbottomrows[sortbottomrows.length] = table.rows[i];
			}
		}
		if (sortbottomrows) {
			if (table.tFoot == null) {
				// table doesn't have a tfoot. Create one.
				tfo = document.createElement('tfoot');
				table.appendChild(tfo);
			}
			for (var i=0; i<sortbottomrows.length; i++) {
				tfo.appendChild(sortbottomrows[i]);
			}
			delete sortbottomrows;
		}
		
		// work through each column and calculate its type
		for (var i=0; i<headrow.length; i++) {
			// manually override the type with a sorttable_type attribute
			if (!headrow[i].className.match(/\bsorttable_nosort\b/)) { // skip this col
				mtch = headrow[i].className.match(/\bsorttable_([a-z0-9]+)\b/);
				if (mtch) { override = mtch[1]; }
				if (mtch && typeof sorttable["sort_"+override] == 'function') {
					headrow[i].sorttable_sortfunction = sorttable["sort_"+override];
				} else {
					headrow[i].sorttable_sortfunction = sorttable.guessType(table,i, sortableMultirow);
				}
				// make it clickable to sort
				headrow[i].sorttable_columnindex = i;
				headrow[i].sorttable_tbody = table.tBodies[0];
				dean_addEvent(headrow[i],"click", function(e) {

					if (this.className.search(/\bsorttable_sorted\b/) != -1) {
						// if we're already sorted by this column, just 
						// reverse the table, which is quicker
						sorttable.reverse(this.sorttable_tbody, sortableMultirow);
						this.className = this.className.replace('sorttable_sorted',
											'sorttable_sorted_reverse');
						this.removeChild(document.getElementById('sorttable_sortfwdind'));
						sortrevind = document.createElement('span');
						sortrevind.id = "sorttable_sortrevind";
						sortrevind.innerHTML = stIsIE ? '&nbsp<font face="webdings">5</font>' : '&nbsp;&#x25B4;';
						this.appendChild(sortrevind);
						return;
					}
					if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) {
						// if we're already sorted by this column in reverse, just 
						// re-reverse the table, which is quicker
						sorttable.reverse(this.sorttable_tbody, sortableMultirow);
						this.className = this.className.replace('sorttable_sorted_reverse',
											'sorttable_sorted');
						this.removeChild(document.getElementById('sorttable_sortrevind'));
						sortfwdind = document.createElement('span');
						sortfwdind.id = "sorttable_sortfwdind";
						sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
						this.appendChild(sortfwdind);
						return;
					}
					
					// remove sorttable_sorted classes
					theadrow = this.parentNode;
					forEach(theadrow.childNodes, function(cell) {
						if (cell.nodeType == 1) { // an element
							cell.className = cell.className.replace('sorttable_sorted_reverse','');
							cell.className = cell.className.replace('sorttable_sorted','');
						}
					});
					sortfwdind = document.getElementById('sorttable_sortfwdind');
					if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
					sortrevind = document.getElementById('sorttable_sortrevind');
					if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
					
					this.className += ' sorttable_sorted';
					sortfwdind = document.createElement('span');
					sortfwdind.id = "sorttable_sortfwdind";
					sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
					this.appendChild(sortfwdind);

					// build an array to sort. This is a Schwartzian transform thing,
					// i.e., we "decorate" each row with the actual sort key,
					// sort based on the sort keys, and then put the rows back in order
					// which is a lot faster because you only do getInnerText once per row
					row_array = [];
					col = this.sorttable_columnindex;
					rows = this.sorttable_tbody.rows;
					for (var j=0; j<rows.length; j+=sortableMultirow) {
						row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
						for(var k=1; k < sortableMultirow;k++)
						{
						  row_array[row_array.length-1][k+1]=rows[j+k];
						}
					}
					/* If you want a stable sort, uncomment the following line */
					//sorttable.shaker_sort(row_array, this.sorttable_sortfunction);
					/* and comment out this one */
					row_array.sort(this.sorttable_sortfunction);
					
					tb = this.sorttable_tbody;
					for (var j=0; j<row_array.length; j++) {
						for(var k=0; k<sortableMultirow; k++) {
							row = row_array[j][k+1];
							if (j % 2 == 0)
								row.className = row.className.replace(' listMReven',' listMRodd');
							else
								row.className = row.className.replace(' listMRodd',' listMReven');

							tb.appendChild(row);
						}
					}
					
					delete row_array;
				});
			}
		}
	},
	
	guessType: function(table, column, sortableMultirow) {
		// guess the type of a column based on its first non-blank row
		sortfn = sorttable.sort_alpha;
		for (var i=0; i<table.tBodies[0].rows.length; i+=sortableMultirow) {
			text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
			if (text != '') {
      				if (text.match(/^\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3}(\:[0-9]{1,5})?\b/)) {
      					return sorttable.sort_ipaddr;
      				}
				if (text.match(/^-?[£$¤]?[\d,.]+%?$/)) {
					return sorttable.sort_numeric;
				}
				// check for a date: dd/mm/yyyy or dd/mm/yy 
				// can have / or . or - as separator
				// can be mm/dd as well
				possdate = text.match(sorttable.DATE_RE);
				if (possdate) {
					// looks like a date
					first = parseInt(possdate[1]);
					second = parseInt(possdate[2]);
					if (first > 12) {
						// definitely dd/mm
						return sorttable.sort_ddmm;
					} else if (second > 12) {
						return sorttable.sort_mmdd;
					} else {
						// looks like a date, but we can't tell which, so assume
						// that it's dd/mm (English imperialism!) and keep looking
						sortfn = sorttable.sort_ddmm;
					}
				}
			}
		}
		return sortfn;
	},
	
	getInnerText: function(node) {
		// gets the text we want to use for sorting for a cell.
		// strips leading and trailing whitespace.
		// this is *not* a generic getInnerText function; it's special to sorttable.
		// for example, you can override the cell text with a customkey attribute.
		// it also gets .value for <input> fields.
		
		hasInputs = (typeof node.getElementsByTagName == 'function') &&
			node.getElementsByTagName('input').length;
		
		if (node.getAttribute("sorttable_customkey") != null) {
			return node.getAttribute("sorttable_customkey");
		}
		else if (typeof node.textContent != 'undefined' && !hasInputs) {
			return node.textContent.replace(/^\s+|\s+$/g, '');
		}
		else if (typeof node.innerText != 'undefined' && !hasInputs) {
			return node.innerText.replace(/^\s+|\s+$/g, '');
		}
		else if (typeof node.text != 'undefined' && !hasInputs) {
			return node.text.replace(/^\s+|\s+$/g, '');
		}
		else {
			switch (node.nodeType) {
			case 3:
				if (node.nodeName.toLowerCase() == 'input') {
					return node.value.replace(/^\s+|\s+$/g, '');
				}
			case 4:
				return node.nodeValue.replace(/^\s+|\s+$/g, '');
				break;
			case 1:
			case 11:
				var innerText = '';
				for (var i = 0; i < node.childNodes.length; i++) {
					innerText += sorttable.getInnerText(node.childNodes[i]);
				}
				return innerText.replace(/^\s+|\s+$/g, '');
				break;
			default:
				return '';
			}
		}
	},
	
	reverse: function(tbody, sortableMultirow) {
		// reverse the rows in a tbody
		newrows = [];
		for (var i=0; i<tbody.rows.length; i++) {
			newrows[newrows.length] = tbody.rows[i];
		}
		for (var i=newrows.length-1; i>=0; i-=sortableMultirow) {
			for(var j=sortableMultirow-1;j>=0;j--)
			{
				tbody.appendChild(newrows[i-j]);
			}
		}
		delete newrows;
	},
	
	/* sort functions
	   each sort function takes two parameters, a and b
	   you are comparing a[0] and b[0] */
	sort_numeric: function(a,b) {
		aa = parseFloat(a[0].replace(/[^0-9.-]/g,''));
		if (isNaN(aa)) aa = 0;
		bb = parseFloat(b[0].replace(/[^0-9.-]/g,'')); 
		if (isNaN(bb)) bb = 0;
		return aa-bb;
	},
	sort_alpha: function(a,b) {
		if (a[0]==b[0]) return 0;
		if (a[0]<b[0]) return -1;
		return 1;
	},
	sort_ddmm: function(a,b) {
		mtch = a[0].match(sorttable.DATE_RE);
		y = mtch[3]; m = mtch[2]; d = mtch[1];
		if (m.length == 1) m = '0'+m;
		if (d.length == 1) d = '0'+d;
		dt1 = y+m+d;
		mtch = b[0].match(sorttable.DATE_RE);
		y = mtch[3]; m = mtch[2]; d = mtch[1];
		if (m.length == 1) m = '0'+m;
		if (d.length == 1) d = '0'+d;
		dt2 = y+m+d;
		if (dt1==dt2) return 0;
		if (dt1<dt2) return -1;
		return 1;
	},
	sort_mmdd: function(a,b) {
		mtch = a[0].match(sorttable.DATE_RE);
		y = mtch[3]; d = mtch[2]; m = mtch[1];
		if (m.length == 1) m = '0'+m;
		if (d.length == 1) d = '0'+d;
		dt1 = y+m+d;
		mtch = b[0].match(sorttable.DATE_RE);
		y = mtch[3]; d = mtch[2]; m = mtch[1];
		if (m.length == 1) m = '0'+m;
		if (d.length == 1) d = '0'+d;
		dt2 = y+m+d;
		if (dt1==dt2) return 0;
		if (dt1<dt2) return -1;
		return 1;
	},
	sortWithNumber: function(a,b) {
		amatch = a[0].match(/.*?(?=[0-9])/);
		bmatch = b[0].match(/.*?(?=[0-9])/);		
		if (amatch && bmatch && amatch[0] == bmatch[0])
		{
			anumber = a[0].substring(amatch.length+1);
			bnumber = b[0].substring(bmatch.length+1);
			a2match = parseInt(anumber.match(/[0-9]*/));
			b2match = parseInt(bnumber.match(/[0-9]*/));
			if (a2match > b2match) return 1;
			if (a2match < b2match) return -1;
		}
		if (a[0] == b[0]) return 0;
		if (a[0] < b[0]) return -1;
		return 1;
	},
	sort_ipaddr: function(a,b) {
		aip = ip2ulong(a[0]);
		bip = ip2ulong(b[0]);
		if (aip && bip)
		{
			if (aip == bip) return 0;
			if (aip < bip) return -1;
			return 1;
		} else {
			if (aip !== false || bip !== false)
				return aip === false ? -1 : 1;
			else
			{			
				return sorttable.sortWithNumber(a,b);
			}
		}
	},
	
	shaker_sort: function(list, comp_func) {
		// A stable sort function to allow multi-level sorting of data
		// see: http://en.wikipedia.org/wiki/Cocktail_sort
		// thanks to Joseph Nahmias
		var b = 0;
		var t = list.length - 1;
		var swap = true;

		while(swap) {
			swap = false;
			for(var i = b; i < t; ++i) {
				if ( comp_func(list[i], list[i+1]) > 0 ) {
					var q = list[i]; list[i] = list[i+1]; list[i+1] = q;
					swap = true;
				}
			} // for
			t--;

			if (!swap) break;

			for(var i = t; i > b; --i) {
				if ( comp_func(list[i], list[i-1]) < 0 ) {
					var q = list[i]; list[i] = list[i-1]; list[i-1] = q;
					swap = true;
				}
			} // for
			b++;

		} // while(swap)
	}  
};

/* ******************************************************************
   Supporting functions: bundled here to avoid depending on a library
   ****************************************************************** */

function ip2ulong(ip) {
	ip += "";
	var ulip = false;
	var octets = [];
	ipportmatch = ip.match(/^\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3}\:[0-9]{1,5}\b/);// IP:port
	if (ipportmatch) {
		ipportmatch += "";
		ipport = ipportmatch.split(':');
		octets = ipport[0].split('.');
		for (i=0; i < 4; i++) {
			ulip += octets[i] * Math.pow(256, (5-i));
		}
		ulip += parseInt(ipport[1]);
	} else {
		ipmatch = ip.match(/^\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3}\b/);// IP only
		if (ipmatch) {
			ipmatch+="";
			octets = ipmatch.split('.');
			for (i=0; i < 4; i++) {
				ulip += octets[i] * Math.pow(256, (5-i));
			}
		}
	}
	return ulip;
}

// Dean Edwards/Matthias Miller/John Resig

/* for Mozilla/Opera9 */
if (document.addEventListener) {
	document.addEventListener("DOMContentLoaded", sorttable.init, false);
}

/* for Safari */
if (/WebKit/i.test(navigator.userAgent)) { // sniff
	var _timer = setInterval(function() {
		if (/loaded|complete/.test(document.readyState)) {
			sorttable.init(); // call the onload handler
		}
	}, 10);
}

/* for other browsers */
window.onload = sorttable.init;

// written by Dean Edwards, 2005
// with input from Tino Zijdel, Matthias Miller, Diego Perini

// http://dean.edwards.name/weblog/2005/10/add-event/

function dean_addEvent(element, type, handler) {
	if (element.addEventListener) {
		element.addEventListener(type, handler, false);
	} else {
		// assign each event handler a unique ID
		if (!handler.$$guid) handler.$$guid = dean_addEvent.guid++;
		// create a hash table of event types for the element
		if (!element.events) element.events = {};
		// create a hash table of event handlers for each element/event pair
		var handlers = element.events[type];
		if (!handlers) {
			handlers = element.events[type] = {};
			// store the existing event handler (if there is one)
			if (element["on" + type]) {
				handlers[0] = element["on" + type];
			}
		}
		// store the event handler in the hash table
		handlers[handler.$$guid] = handler;
		// assign a global event handler to do all the work
		element["on" + type] = handleEvent;
	}
};
// a counter used to create unique IDs
dean_addEvent.guid = 1;

function removeEvent(element, type, handler) {
	if (element.removeEventListener) {
		element.removeEventListener(type, handler, false);
	} else {
		// delete the event handler from the hash table
		if (element.events && element.events[type]) {
			delete element.events[type][handler.$$guid];
		}
	}
};

function handleEvent(event) {
	var returnValue = true;
	// grab the event object (IE uses a global event object)
	event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event);
	// get a reference to the hash table of event handlers
	var handlers = this.events[event.type];
	// execute each event handler
	for (var i in handlers) {
		this.$$handleEvent = handlers[i];
		if (this.$$handleEvent(event) === false) {
			returnValue = false;
		}
	}
	return returnValue;
};

function fixEvent(event) {
	// add W3C standard event methods
	event.preventDefault = fixEvent.preventDefault;
	event.stopPropagation = fixEvent.stopPropagation;
	return event;
};
fixEvent.preventDefault = function() {
	this.returnValue = false;
};
fixEvent.stopPropagation = function() {
	this.cancelBubble = true;
};

// Dean's forEach: http://dean.edwards.name/base/forEach.js
/*
  forEach, version 1.0
  Copyright 2006, Dean Edwards
  License: http://www.opensource.org/licenses/mit-license.php
*/

// array-like enumeration
if (!Array.forEach) { // mozilla already supports this
	Array.forEach = function(array, block, context) {
		for (var i = 0; i < array.length; i++) {
			block.call(context, array[i], i, array);
		}
	};
}

// generic enumeration
Function.prototype.forEach = function(object, block, context) {
	for (var key in object) {
		if (typeof this.prototype[key] == "undefined") {
			block.call(context, object[key], key, object);
		}
	}
};

// character enumeration
String.forEach = function(string, block, context) {
	Array.forEach(string.split(""), function(chr, index) {
		block.call(context, chr, index, string);
	});
};

// globally resolve forEach enumeration
var forEach = function(object, block, context) {
	if (object) {
		var resolve = Object; // default
		if (object instanceof Function) {
			// functions have a "length" property
			resolve = Function;
		} else if (object.forEach instanceof Function) {
			// the object implements a custom forEach method so use that
			object.forEach(block, context);
			return;
		} else if (typeof object == "string") {
			// the object is a string
			resolve = String;
		} else if (typeof object.length == "number") {
			// the object is array-like
			resolve = Array;
		}
		resolve.forEach(object, block, context);
	}
};

=======
/* $Id$ */
/*
 * sorttable.js - Renders standard HTML tables into sortable tables.
 *
 * Based on "sorttable" by Stuart Langridge, published under the MIT licence.
 * Modified and extended by Daniel Berlin.
 *
 * Usage:
 *  - All rows (except for those with class "sort_footer") should NOT contain <td>s with
 *    the "colspan" property set. Otherwise sorting might not work correctly.
 *
 *   <table class="myClass sortable">		<-- Add class "sortable"
 *    <tr>									<-- The first row will automatically
 *     <td>Number</td>							be treated as the header line
 *     <td>Value</td>
 *     <td class="sort_ignore">...</td>		<-- Class "sort_ignore" prevents
 *    </tr>										sorting by this column
 *    <tr>
 *     <td>1</td>
 *     <td>Hello World</td>
 *     <td>...</td>
 *    </tr>
 *    <tr>
 *     <td>2</td>
 *     <td>Bye World</td>
 *     <td>...</td>
 *    </tr>
 *    <tr class="sort_footer">				<-- Class "sort_footer" excludes this line
 *     <td>Footer</td>							from sorting (may appear several times)
 *     <td colspan="2">...</td>				<-- In the footer(s), "colspan" is harmless
 *    </tr>
 *  </table>
 */

var ts_CASE_SENSITIVE = false;			//	<-- Set this to true to do case-sensitive sorting

/*** Main ***/

var ts_SORT_FUNCTION;
var ts_COLUMN_INDEX;

new ts_EventHandler(
	window, "load",
	function() {
		if(! document.getElementsByTagName) return;

		// Find all tables with class "sortable" and make them sortable
		var tabs = document.getElementsByTagName("table");
		for(var i = 0; i < tabs.length; i++)
			if(ts_hasClass(tabs[i], "sortable"))
				ts_tableMakeSortable(tabs[i]);
	}
);

/*** Event Handlers ***/

// Make the table sortable
function ts_tableMakeSortable(table) {
	if(table.rows && table.rows.length > 0) {
		var firstRow = table.rows[0];
	}
	if(! firstRow) return;

	// We have a first row: assume it's the header
	for(var i = 0; i < firstRow.cells.length; i++) {
		var cell = firstRow.cells[i];

		// Ignore header cells with class "sort_ignore"
		if(ts_hasClass(cell, "sort_ignore"))
			continue;

		// Make it clickable
		new ts_EventHandler(cell, "click", ts_tableResort, cell);
		ts_setCursor(cell, "pointer");

		cell.innerHTML = ts_getInnerText(cell) +
			'<span class="sortarrow" style="font-weight:bold;">&nbsp;&nbsp;&nbsp;</span>';
	}
}

// Re-Sort the table
function ts_tableResort() {
	// Note: 'this' refers to the cell, the user clicked on

	var tab = ts_getParentByTag(this, "table");
	if(tab.rows.length <= 1) return;

	var txt = ts_getInnerText(tab.rows[1].cells[this.cellIndex]);

	// Determine, how we sort (the order of tests matters):
	//  1. Case (in)sensitive (default)
	ts_SORT_FUNCTION = ts_CASE_SENSITIVE ? ts_sortCaseSensitive : ts_sortCaseInsensitive;

	//  2. Date
	//  TODO: this needs to be extended to match a wider range of dates
	if(txt.match(/^\d\d[\/-]\d\d[\/-]\d\d\d\d$/)) ts_SORT_FUNCTION = ts_sortDate;
	if(txt.match(/^\d\d[\/-]\d\d[\/-]\d\d$/)    ) ts_SORT_FUNCTION = ts_sortDate;

	//  3. Currency
	//  Note: commented out, because we don't need it
	//var regexp = new RegExp("^\s*[$" + String.fromCharCode(163, 165, 8364) + "]");
	//if(regexp.test(txt)) ts_SORT_FUNCTION = ts_sortCurrency;

	//  4. Numeric
	if(txt.match(/^\s*[\d\.]+\s*$/)) ts_SORT_FUNCTION = ts_sortNumeric;

	//  5. IP-Address
	if(txt.match(/^\s*[0-9]+\.[0-9]+\.[0-9]+\.[0-9]+\s*$/)) ts_SORT_FUNCTION = ts_sortIpAddress;

	ts_COLUMN_INDEX = this.cellIndex;

	var bodyRows   = new Array();
	var bottomRows = new Array();

	for(var i = 1; i < tab.rows.length; i++)
		if(ts_hasClass(tab.rows[i], "sort_footer"))
			bottomRows.push(tab.rows[i]);
		else
			bodyRows.push(tab.rows[i]);
			
	bodyRows.sort(ts_sort);

	var span = ts_getChildByTagAndClass(this, "span", "sortarrow");
	if(span.getAttribute("sortdir") == "down") {
		var arrow = "&nbsp;&nbsp;&uarr;";
		span.setAttribute("sortdir", "up");
		bodyRows.reverse();
	}
	else {
		var arrow = "&nbsp;&nbsp;&darr;";
		span.setAttribute("sortdir", "down");
	}

	// We appendChild rows that already exist to the <tbody>,
	// so it moves them rather than creating new ones:
	//  1. Append body-rows in sorted order
	for(i = 0; i < bodyRows.length; i++)
		tab.tBodies[0].appendChild(bodyRows[i]);

	//  2. Append bottom line(s) in original order to the end
	for(i = 0; i < bottomRows.length; i++)
		tab.tBodies[0].appendChild(bottomRows[i]);

	// Delete any other arrows there may be showing
	var spans = document.getElementsByTagName("span");
	for(var i = 0; i < spans.length; i++)
		if(ts_hasClass(spans[i], "sortarrow") && ts_getParentByTag(spans[i], "table") == tab)
			spans[i].innerHTML = '&nbsp;&nbsp;&nbsp;';

	span.innerHTML = arrow;
}

/*** Sort Functions ***/

function ts_sort(a, b) {
	if(typeof a.cells[ts_COLUMN_INDEX] == "undefined" ||
	   typeof b.cells[ts_COLUMN_INDEX] == "undefined")
		return 0;

	return ts_SORT_FUNCTION(
		ts_getInnerText(a.cells[ts_COLUMN_INDEX]),
		ts_getInnerText(b.cells[ts_COLUMN_INDEX])
	);
}

// 1.1. Case insensitive
function ts_sortCaseInsensitive(a, b) {
	return ts_sortCaseSensitive(
		a.toLowerCase(), b.toLowerCase()
	);
}

// 1.2. Case sensitive
function ts_sortCaseSensitive(a, b) {
	if(a == b) return  0;
	if(a <  b) return -1;
	return 1;
}

// 2. Date
//  TODO: this needs to be extended to match a wider range of dates
function ts_sortDate(a, b) {
	var d1, d2;

	// Y2k note: two digit years < 50 are treated as 20xx, >= 50 are treated as 19xx
	if(a.length == 10)
		d1 = a.substr(6, 4) + a.substr(3, 2) + a.substr(0, 2);
	else {
		var yr = a.substr(6, 2);
		if(parseInt(yr) < 50) yr = "20" + yr;
		else                  yr = "19" + yr;
		d1 = yr + a.substr(3, 2) + a.substr(0, 2);
	}
	if(b.length == 10)
		d2 = b.substr(6, 4) + b.substr(3, 2) + b.substr(0, 2);
	else {
		var yr = b.substr(6, 2);
		if(parseInt(yr) < 50) yr = "20" + yr;
		else                  yr = "19" + yr;
		d2 = yr + b.substr(3, 2) + b.substr(0, 2);
	}
	if(d1 == d2) return  0;
	if(d1 <  d2) return -1;
	return 1;
}

// 3. Currency
//    Note: commented out, because we don't need it
/*
function ts_sortCurrency(a, b) { 
	a = a.replace(/[^0-9.]/g, "");
	b = b.replace(/[^0-9.]/g, "");

	return parseFloat(a) - parseFloat(b);
}
*/

// 4. Numeric
function ts_sortNumeric(a, b) { 
	a = parseFloat(a); if(isNaN(a)) a = 0;
	b = parseFloat(b); if(isNaN(b)) b = 0;

	return a - b;
}

// 5. IP-Address
function ts_sortIpAddress(a, b) {
	var oa = a.split(".");
	var ob = b.split(".");

	for(var i = 0; i < 4; i++) {
		if(parseInt(oa[i]) < parseInt(ob[i])) return -1;
		if(parseInt(oa[i]) > parseInt(ob[i])) return  1;
	}
	return 0;
}

/*** Internal Functions ***/

// Get a parentNode by it's tagName property
function ts_getParentByTag(element, pTag) {
	if(typeof element != "object")
		return null;
	else if(element.nodeType == 1 && element.tagName.toLowerCase() == pTag.toLowerCase())
		return element;
	else
		return ts_getParentByTag(element.parentNode, pTag);
}

// Get a childnode by it's tagName property and class
function ts_getChildByTagAndClass(element, pTag, pClass) {
	if(typeof element != "object")
		return null;

	var childs = element.childNodes;
	for(var i = 0; i < childs.length; i++)
		if(childs[i].nodeType == 1 /* ELEMENT_NODE */             &&
			childs[i].tagName.toLowerCase() == pTag.toLowerCase() &&
			ts_hasClass(childs[i], pClass) >= 0)
				return childs[i];

	return null;
}

// Determine, whether an element has a specific class in it's className
function ts_hasClass(element, eClass) {
	if(! element.className)
		return false;

	if(element.className)
		var classes = element.className.split(/\s+/g);
	else if(element.hasAttribute && element.hasAttribute("class"))
		var classes = element.getAttribute("class").split(/\s+/g);
	else
		return false;

	for(var i = 0; i < classes.length; i++)
		if(classes[i] == eClass)
			return true;

	return false;
}

// Get an element's innerText property
function ts_getInnerText(element) {
	if(typeof element == "string")
		return element;
	else if (typeof element == "undefined")
		return "";

	if(element.innerText) return element.innerText;

	var str = "";
	var childs = element.childNodes;
	var l = childs.length;
	for(var i = 0; i < l; i++) {
		switch(childs[i].nodeType) {
			case 1: // ELEMENT_NODE
				str += ts_getInnerText(childs[i]);
				break;
			case 3:	// TEXT_NODE
				str += childs[i].nodeValue;
				break;
		}
	}
	return str;
}

/* Class to add an event handler to an element
 *  <element>   - element to add the event handler to    (Object)
 *  <event>     - event to listen on                     (String)
 *  <handler>   - function to execute if an event fires  (Function)
 *  [<context>] - context to execute the handler in      (Object)
 */
function ts_EventHandler(element, event, handler, context) {
	var self     = this;
	this.context = typeof(context) == "object" ? context : null;

	event = event.toLowerCase();
	if(event.substring(0, 2) == "on")
		event = event.substring(2);

	var evHandler = this.context
		? function(ev) { handler.call(self.context, ev); }
		: function(ev) { handler     (ev);               }

	// W3C DOM, Level 2 (Event Specification)
	if(element.addEventListener) {
		element.addEventListener(event, evHandler, false);
		return true;
	}
	// Microsoft Event Model
	else if(element.attachEvent)
		return element.attachEvent("on" + event, evHandler);
	else
		return false;
}

// Set an element's cursor-style
function ts_setCursor (element, type) {
	if (! type) type = "auto";
	/*@cc_on
		// MSIE <= 5.5
		@if (@_jscript_version <= 5.5)
			if (type == "pointer") type = "hand";
		@end
	@*/

	element.style.cursor = type;
}
>>>>>>> FETCH_HEAD
